K-Centers Clustering Protocol over Heterogeneous Wireless Sensor Networks

This paper introduces a K-Centers clustering protocol for heterogeneous wireless sensor networks. Energy consumption is an important issue for wireless sensor networks, and sensor nodes consume most of their energy with data delivery. The energy needed to transmit data is proportional to the distance between sensor nodes and either cluster heads or a base station. Clustering is an efficient technique for saving energy and extending network life. The authors’ protocol uses a K-centers clustering algorithm to alter the network, topology and establish data routing. The result is k cluster heads which accommodate the distribution of sensor nodes and achieve minimum maximum intra-cluster distances. Their simulations show that their algorithm will outperform K-Means under many but not all conditions. The authors’ always produce better minimum maximum intra-cluster distances compared to K-means. K-Centers Clustering Protocol over Heterogeneous Wireless Sensor Networks